Lambertian Reeectance and Linear Subspaces

نویسندگان

  • Ronen Basri
  • David Jacobs
چکیده

Weizmann Institute of Science, Technical Report MCS00-21 NEC Research Institute Technical Report 2000-172R Ronen Basri David Jacobs Dept. of Computer Science NEC Research Institute The Weizmann Institute of Science 4 Independence Way Rehovot, 76100 Israel Princeton, NJ 08540 Abstract We prove that the set of all re ectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wide variety of lighting conditions can be approximated accurately by a low-dimensional linear subspace, explaining prior empirical results. We also provide a simple analytic characterization of this linear space. We obtain these results by representing lighting using spherical harmonics and describing the e ects of Lambertian materials as the analog of a convolution. These results allow us to construct algorithms for object recognition based on linear methods as well as algorithms that use convex optimization to enforce non-negative lighting functions. Finally, we show a simple way to enforce non-negative lighting when the images of an object lie near a 4D linear space.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recovering the Shape of Polyhedra Using Line-drawing Analysis and Complex Reeectance Models

Following Sugihara 23], we represent the geometric constraints imposed by the line-drawing of a polyhedron as a set of linear equalities and inequalities. Unlike him, we explicitly take into account the uncertainty in vertex position. This allows us to circumvent the superstrictness of the constraints without deleting any of them. For a given error bound, deciding whether a line-drawing is the ...

متن کامل

Seeing Beyond Lambert's Law

Lambert's model for diiuse reeection is extensively used in computational vision. For several real-world objects, the Lambertian model can prove to be a very inaccurate approximation to the diiuse component. While the brightness of a Lambertian surface is independent of viewing direction, the brightness of a rough diiuse surface increases as the viewer approaches the source direction. A compreh...

متن کامل

Shape from shading using linear approximation

In this paper, we present an extremely simple algorithm for shape from shading, which can be implemented in 25 lines of C code 1. The algorithm is very fast, taking .2 seconds on a Sun SparcStation-1 for a 128 128 image, and is purely local and highly parallelizable (parallel implementation included). In our approach, we employ a linear approximation of the reeectance function, as used by other...

متن کامل

Lambertian Reflectance and Linear Subspaces

We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D linear subspace. This implies that, in general, the set of images of a convex Lambertian object obtained under a wide variety of lighting conditions can be approximated accurately by a low-dimensional linear subspace, ex...

متن کامل

Nonlinear k-subspaces based appearances clustering of objects under varying illumination conditions

Unsupervised clustering of image sets of 3D objects has been an active research field within vision community. It is a challenging task since the appearance variation of the same object under different illumination condition is often larger than the appearance variation of different object under the same illumination condition. Some previous methods perform the appearance clustering using k-sub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000